Ratewise-optimal non-sequential search strategies under constraints on the tests

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ratewise-optimal non-sequential search strategies under constraints on the tests

Already in his Lectures on Search Renyi suggested to consider a search problem, where an unknown x ∈ X = {1, 2, . . . , n} is to be found by asking for containment in a minimal number m(n, k) of subsets A1, . . . , Am with the restrictions |Ai| ≤ k < n2 for i = 1, 2, . . . ,m. Katona gave in 1966 the lower bound m(n, k) ≥ log n h( k n) in terms of binary entropy and the upper bound m(n, k) ≤ ⌈

متن کامل

Optimal market making strategies under inventory constraints

We study the problem of a market-maker acting as a liquidity provider by continuously setting bid and ask prices for an illiquid asset. We assume that the market maker has a contractual obligation to permanently quote bid and ask prices for the security and therefore to satisfy any sell or buy order from the asset’s investors. On the opposite side of the trades, there are investors who act as l...

متن کامل

the washback effect of discretepoint vs. integrative tests on the retention of content in knowledge tests

در این پایان نامه تاثیر دو نوع تست جزیی نگر و کلی نگر بر به یادسپاری محتوا ارزیابی شده که نتایج نشان دهندهکارایی تستهای کلی نگر بیشتر از سایر آزمونها است

15 صفحه اول

Optimal Sequential Multiple Hypothesis Tests

This work deals with a general problem of testing multiple hypotheses about the distribution of a discrete-time stochastic process. Both the Bayesian and the conditional settings are considered. The structure of optimal sequential tests is characterized.

متن کامل

Repeated Auctions under Budget Constraints: Optimal bidding strategies and Equilibria

How should agents bid in repeated sequential auctions when they are budget constrained? A motivating example is that of sponsored search auctions, where advertisers bid in a sequence of generalized second price (GSP) auctions. These auctions, specifically in the context of sponsored search, have many idiosyncratic features that distinguish them from other models of sequential auctions: First, e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2008

ISSN: 0166-218X

DOI: 10.1016/j.dam.2006.06.013